NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
151	CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-04 19:18:44 NP-complete problems Edsger W. Dijkstra Spanning tree Matroid theory Operations research Online algorithm Steiner tree problem Matroid Shortest path problem Algorithm Travelling salesman problem Greedy algorithm
152	43 Documenta Math. ¨ nigsberg, Euler, Mei-Ko Kwan, Ko Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2012-07-25 10:24:40 Graph theory NP-complete problems Eulerian path Route inspection problem Cycle Degree Leonhard Euler Matching Seven Bridges of Knigsberg 2-factor theorem
153	Metric Clustering via Consistent Labeling Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2010-09-28 14:30:42 Combinatorial optimization Operations research NP-complete problems Approximation algorithms Computational problems Linear programming Minimum k-cut Optimization problem Ear decomposition Decomposition method
154	PDF Document Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2013-07-05 20:53:24 Crosswords NP-complete problems Cryptic crossword Cluedo Logic puzzles Recreational mathematics
155	Newport Renews 1 by Ucaoimhu Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2011-07-01 05:57:29 NP-complete problems Crossword Puzzles Cryptic crossword Cluedo
156	Sudoku Squares and Chromatic Polynomials Agnes M. Herzberg and M. Ram Murty T Add to Reading List Source URL: www.mast.queensu.ca Language: English - Date: 2007-07-03 14:08:13 Graph coloring NP-complete problems Recreational mathematics Sudoku Logic puzzles Mathematics of Sudoku Latin square Chromatic polynomial Sudoku Codes Sudoku solving algorithms
157	Microsoft Word - WebArchiving_v6.doc Add to Reading List Source URL: wiki.umiacs.umd.edu Language: English - Date: 2008-09-10 16:29:18 Combinatorial optimization NP-complete problems Graph partition PageRank Graph Cut Matching Minimum cut Graph theory Line graph
158	Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind† Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2016-07-01 10:19:11 NP-complete problems Clique problem Vertex cover Clique Independent set Bipartite graph Travelling salesman problem Graph coloring Line graph Treewidth Pathwidth
159	Moment methods in energy minimization David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) L´aszl´ Add to Reading List Source URL: www.daviddelaat.nl Language: English Operations research Discrete geometry NP-complete problems Conjectures Circle packing Sphere packing Independent set Kepler conjecture Tammes problem Mathematical optimization Semidefinite programming FranklRdl graph
160	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability

UPDATE